منابع مشابه
Matrices with Identical Sets of Neighbors
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. INFORMS is collaborating with JSTOR to digitize, preserve...
متن کاملCombining Distance Matrices on Identical Taxon Sets for Multi-Gene Analysis with Singular Value Decomposition
We present a simple and effective method for combining distance matrices from multiple genes on identical taxon sets to obtain a single representative distance matrix from which to derive a combined-gene phylogenetic tree. The method applies singular value decomposition (SVD) to extract the greatest common signal present in the distances obtained from each gene. The first right eigenvector of t...
متن کاملDirect Product Testing With Nearly Identical Sets
In this work we analyze a direct product test in which each of two provers receives a subset of size n of a ground set U , |U | = Θ(n), and the two subsets intersect in about (1 − δ)n elements. We show that if each of the provers provides labels to the n elements it received, and the labels of the two provers agree in the intersection between the subsets with non-negligible probability, then th...
متن کاملSelection in Monotone Matrices and Computing kth Nearest Neighbors
' ŽŽ . . We present an O m q n n log n time algorithm to select the k th smallest item from an m = n totally monotone matrix for any k F mn. This is the first subquadratic algorithm for selecting an item from a totally monotone matrix. Our method also yields an algorithm of the same time complexity for a generalized 4 row-selection problem in monotone matrices. Given a set S s p , . . . , p of ...
متن کاملInvestigation of Graphs Having Identical Path Layer Matrices
The path layer matrix of a graph G, discussed by Dobrynin [1, 2, 3] and Yang et al. [9], is the matrix τ(G) = ‖τi,j‖, where i = 1, 2, . . . , p(G) and j = 1, 2, . . . , p(G) − 1, and the value of τi,j is the number of paths with initial vertex vi having length j [1]. In this paper we seek to determine the minimal order p such that there exist nonisomorphic graphs G1 and G2 with order p and τ(G1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1998
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.23.4.863